Distributed greedy pursuit algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Greedy Pursuit Algorithms

For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes. Based on this signal model along with a brief survey of existing greedy algorithms, we develop distributed greedy algorithms with low communicati...

متن کامل

Distributed Algorithms for Basis Pursuit

The Basis Pursuit (BP) problem consists in finding a least `1 norm solution of the underdetermined linear system Ax = b. It arises in many areas of electrical engineering and applied mathematics. Applications include signal compression and modeling, estimation, fitting, and compressed sensing. In this paper, we explore methods for solving the BP in a distributed environment, i.e., when the comp...

متن کامل

Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit

A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals that participate. These elementary signals typically model coherent structures in the input signals, and they...

متن کامل

Analysis of Democratic Voting Principles used in Distributed Greedy Algorithms

A key aspect for any greedy pursuit algorithm used in compressed sensing is a good support-set detection method. For distributed compressed sensing, we consider a setup where many sensors measure sparse signals that are correlated via the existence of a signals’ intersection support-set. This intersection support-set is called the joint support-set. Estimation of the joint support-set has a hig...

متن کامل

Distributed Optimization in DTNs: Towards Understanding Greedy and Stochastic Algorithms

Opportunistic or Delay Tolerant Networks is a new networking paradigm that is envisioned to complement existing wireless technologies (cellular, WiFi) by exploiting a “niche” performance-cost tradeoff. Wireless peers communicate when in contact, forming a network “on the fly” whose connectivity graph is highly dynamic and only partially connected. This gives rise to a number of challenging opti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing

سال: 2014

ISSN: 0165-1684

DOI: 10.1016/j.sigpro.2014.05.027